Topological Properties of Wireless Sensor Networks Under the Q-Composite Key Predistribution Scheme With Unreliable Links (CMU-CyLab-14-002)
نویسندگان
چکیده
The seminal q-composite key predistribution scheme[3] (IEEE S&P; 2003) is used prevalently for secure communica-tions in large-scale wireless sensor networks (WSNs). Yağan [12](IEEE IT 2012) and we [15] (IEEE ISIT 2013) explore topologicalproperties of WSNs employing the q-composite scheme in thecase of q = 1 with unreliable communication links modeledas independent on/off channels. However, it is challenging toderive results for general q under such on/off channel model. Inthis paper, we resolve such challenge and investigate topologicalproperties related to node degree in WSNs operating under theq-composite scheme and the on/off channel model. Our resultsapply to general q, yet there has not been any work in theliterature reporting the corresponding results even for q = 1,which are stronger than those about node degree in [12], [15].Specifically, we show that the number of nodes with an arbitrarydegree asymptotically converges to a Poisson distribution, presentthe asymptotic probability distribution for the minimum nodedegree of the network, and establish the asymptotically exactprobability for the property that the minimum node degree isat least an arbitrary value. Numerical experiments confirm thevalidity our analytical findings.
منابع مشابه
Connectivity in Secure Wireless Sensor Networks under Transmission Constraints (CMU-CyLab-14-003)
In wireless sensor networks (WSNs), the Eschenauer–Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although the connectivity properties of secure WSNs with the EG scheme have been extensively investigated, few results address physical transmission constraints. These constraints reflect real–world implementations of WSNs in which two sensors have to b...
متن کاملDesigning Securely and Reliably Connected Wireless Sensor Networks
In wireless sensor networks, the q-composite key predistribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure sensor networks with the q-composite scheme have been studied in the literature, few results address physical transmission constraints since it is challenging to analyze the network connectivity in consideration of both the q-com...
متن کاملRandom Key Pre-Distribution Techniques against Sybil Attacks
Sybil attacks pose a serious threat for Wireless Sensor Networks (WSN) security. They can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. In a Sybil attack, the attacker masquerades as multiple sensor identities that are actually controlled by one or a few existing attacker nodes. Sybil identities are fabricated out of stolen keys, obt...
متن کاملResults on Vertex Degree and K-Connectivity in Uniform S-Intersection Graphs (CMU-CyLab-14-004)
We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically , we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor network e...
متن کاملA novel key management scheme for heterogeneous sensor networks based on the position of nodes
Wireless sensor networks (WSNs) have many applications in the areas of commercial, military and environmental requirements. Regarding the deployment of low cost sensor nodes with restricted energy resources, these networks face a lot of security challenges. A basic approach for preparing a secure wireless communication in WSNs, is to propose an efficient cryptographic key management protocol be...
متن کامل